Computer science - PDFSEARCH.IO - Document Search Engine

Computer science
Results: 55984

#	Item
141	Automated Verification Techniques for Probabilistic Systems Vojtˇech Forejt1 , Marta Kwiatkowska1 , Gethin Norman2 , and David Parker1 1 Department of Computer Science, University of Oxford, Oxford, OX1 3QD, UK Add to Reading List Source URL: qav.comlab.ox.ac.uk Language: English - Date: 2013-10-06 19:34:00 Markov models Probability Dynamic programming Markov processes Stochastic control Markov decision process Markov chain Linear temporal logic S2 Reinforcement learning S0
142	Revisiting Question Answering in Vampire Giles Reger School of Computer Science, University of Manchester, UK The 4th Vampire Workshop Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2017-08-08 02:42:18 Automated theorem proving Resolution IP X0 Vampire Mathematics Propositional calculus Logic
143	On Stochastic Games with Multiple Objectives Taolue Chen, Vojtˇech Forejt, Marta Kwiatkowska, Aistis Simaitis, and Clemens Wiltsche Department of Computer Science, University of Oxford, United Kingdom Abstract. We stud Add to Reading List Source URL: qav.comlab.ox.ac.uk Language: English - Date: 2013-06-19 11:02:11 Mathematical analysis Measure theory Mathematics Probability and statistics Determinacy Stochastic game Strategy Markov chain Stochastic process Support Mathematical optimization Statistical model
144	Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607 Add to Reading List Source URL: cims.nyu.edu Language: English - Date: 2015-11-01 13:02:43 Search algorithms Routing algorithms Combinatorial optimization Mathematics Information science Information retrieval Game artificial intelligence A* search algorithm Heuristic Bayesian network Dijkstra's algorithm Algorithm
145	Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2017-07-30 15:10:48 Mathematical logic Theoretical computer science Mathematics Quantification Logic in computer science Formal methods Electronic design automation NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Universal quantification True quantified Boolean formula
146	Dr. Markus Völter (Voelter) Born February 14, 1974, in Heidenheim/Brenz, Germany Degrees Dipl. Ing. (FH) Physikalische Technik (Physics Engineering) PhD in Computer Science LAST CHANGED Add to Reading List Source URL: www.voelter.de Language: English - Date: 2018-05-23 13:30:47 Language workbench Computing Software engineering Software Itemis Domain-specific language Xtext JetBrains MPS JetBrains Software development OOPSLA Model-driven engineering
147	Structural Properties in δ-Hyperbolic Networks: Algorithmic Analysis and Implications Hend Alrasheed Kent State University, Department of Computer Science Kent Ohio, USA Add to Reading List Source URL: gdac.uqam.ca Language: English - Date: 2017-10-04 00:34:48 Graph theory Network theory Bipartite graphs Graph operations Centrality Network analysis Distance Graph Connectivity Tree Shortest path problem Degeneracy
148	Logical Methods in Computer Science Vol. 2 (5:, pp. 1–31 www.lmcs-online.org Submitted Published Add to Reading List Source URL: arxiv.org Language: English - Date: 2008-02-05 14:26:41 Algebra Mathematics Abstract algebra Category theory Universal algebra Boolean algebra Mathematical logic Adjoint functors F-algebra Variety Monad Sigma-algebra
149	Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 Jovanovi´c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford Uni Add to Reading List Source URL: csl.sri.com Language: English - Date: 2018-04-25 11:34:43 Theoretical computer science Mathematics Mathematical logic Logic in computer science Automated theorem proving Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Boolean satisfiability problem Substitution Model theory
150	Remy Goldschmidt Education 2014–2018 Bachelor of Science in Computer Science, University of Illinois at Urbana-Champaign. Work Experience Summer 2017 Software Engineering Intern, Awake Networks. Add to Reading List Source URL: taktoa.me Language: English - Date: 2018-03-28 11:19:15 Software engineering Computer programming Programming language theory Functional languages Programming paradigms Haskell Literate programming Functional programming OCaml Bachelor of Computer Science Conditional